Geometric p-Center Problems with Centers Constrained to Two Lines
نویسندگان
چکیده
We consider the k-center problem, in which the centers are constrained to lie on two axis-parallel lines. Given a set of n weighted points in the plane, which are sorted according to their x-coordinates, we show how to test in O(n logn) time if k piercing points placed on two lines, parallel to the x-axis, can pierce all the disks of different radii centered at the n given points. This leads to an O(n log n) time algorithm for the weighted k-center problem. We then consider the unweighted case, where the centers are constrained to be on two perpendicular lines. Our algorithms run in O(n log n) time in this case also.
منابع مشابه
Geometric Programming with Stochastic Parameter
Geometric programming is efficient tool for solving a variety of nonlinear optimizationproblems. Geometric programming is generalized for solving engineering design. However,Now Geometric programming is powerful tool for optimization problems where decisionvariables have exponential form.The geometric programming method has been applied with known parameters. However,the observed values of the ...
متن کاملConstrained Multi-Objective Optimization Problems in Mechanical Engineering Design Using Bees Algorithm
Many real-world search and optimization problems involve inequality and/or equality constraints and are thus posed as constrained optimization problems. In trying to solve constrained optimization problems using classical optimization methods, this paper presents a Multi-Objective Bees Algorithm (MOBA) for solving the multi-objective optimal of mechanical engineering problems design. In the pre...
متن کامل(n,1,1,α)-Center Problem
Given a set of points in the plane and a constant ,-center problem is to find two closed disks which each covers the whole , the diameter of the bigger one is minimized, and the distance of the two centers is at least . Constrained -center problem is the -center problem in which the centers are forced to lie on a given line . In this paper, we first introduce -center problem and its constrain...
متن کاملConstrained Geodesic Centers of a Simple Polygon
For any two points in a simple polygon P , the geodesic distance between them is the length of the shortest path contained in P that connects them. A geodesic center of a set S of sites (points) with respect to P is a point in P that minimizes the geodesic distance to its farthest site. In many realistic facility location problems, however, the facilities are constrained to lie in feasible regi...
متن کاملConstrained k-center and movement to independence
We obtain hardness results and approximation algorithms for two related geometric problems involving movement. The first is a constrained variant of the k-center problem, arising from a geometric client-server problem. The second is the problem of moving points towards an independent set.
متن کامل